Efficient filtering of adult content using textual information

Nowadays adult content represents a non negligible proportion of the Web content. It is of the utmost importance to protect children from this content. Search engines, as an entry point for Web navigation are ideally placed to deal with this issue. In this paper, we propose a method that builds a safe index i.e. adult-content free for search engines. This method is based on a filter that uses only textual information from the web page and the associated URL

Distribution, Approximation and Probabilistic Model Checking

AbstractAPMC is a model checker dedicated to the quantitative verification of fully probabilistic systems against LTL formulas. Using a Monte-Carlo method in order to efficiently approximate the verification of probabilistic specifications, it could be used naturally in a distributed framework. We present here the tool and its distribution scheme, together with extensive performance evaluation, showing the scalability of the method, even on clusters containing 500+ heterogeneous workstations

Uniform Random Sampling of Traces in Very Large Models

This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating reactive modules. The method relies upon techniques for counting and drawing uniformly at random words in regular languages. Each module is considered as an automaton defining such a language. It is shown how it is possible to combine local uniform drawings of traces, and to obtain some global uniform random sampling, without construction of the global model

Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC

AbstractCarrier Sense Multiple Access/Collision Detection (CSMA/CD) is the protocol for carrier transmission access in Ethernet networks (international standard IEEE 802.3). On Ethernet, any Network Interface Card (NIC) can try to send a packet in a channel at any time. If another NIC tries to send a packet at the same time, a collision is said to occur and the packets are discarded. The CSMA/CD protocol was designed to avoid this problem, more precisely to allow a NIC to send its packet without collision. This is done by way of a randomized exponential backoff process. In this paper, we analyse the correctness of the CSMA/CD protocol, using techniques from probabilistic model checking and approximate probabilistic model checking. The tools that we use are PRISM and APMC. Moreover, we provide a quantitative analysis of some CSMA/CD properties

Informatique Mathématique : une photographie en 2014

National audienc

Rocovo : Robust Communal Publication Scheme

International audienceWe study the problem of designing a robust validation method for publishing content on social websites. In such websites, users can propose their content to the community. Since the data is user generated, a huge volume of content is pub-lished every day on a successful platform. An important problem arising in such websites is that users have to filter all the published content to find something interesting. This filtering can be assisted by the website, thanks to a recom-mendation mechanism. An even more important problem is that the context is adversarial: some malicious users try to trick the system in order to either publish their own content or make sure that specific content is not published. There-fore, users might not find the content they are interested in either because it is diluted in an ocean of spam or because it was maliciously blocked from publication. In this paper, we present Rocovo (RObust COmmunal VOting), a two phases mechanism that allows for the automatic management of the publication process in a robust and communal manner

Efficient filtering of adult content using textual information

International audienceNowadays adult content represents a non negligible proportion of the Web content. It is of the utmost importance to protect children from this content. Search engines, as an entry point for Web navigation are ideally placed to deal with this issue. In this paper, we propose a method that builds a safe index i.e. adult-content free for search engines. This method is based on a filter that uses only textual information from the web page and the associated URL

Algorithmique du web : autour du pagerank

National audienceCet ouvrage rassemble les cours de l'École des Jeunes Chercheurs en Informatique Mathématique tenue en 2014. Ses grands axes -- algorithmique et combinatoire, logique et complexité, calcul formel, arithmétique et géométrie -- sont illustrés par des sujets choisis pour composer une photographie de la recherche en Informatique Mathématique en 2014.Édition Première éditionÉditeur Presses Universitaires de PerpignanSupport Livre brochéNb de pages XIII - 222 p.ISBN-10 2354122284ISBN-13 978235412228